Explorer Guarded - Based Disjunctive Tuple - Generating Dependencies

A Guarded-Based Disjunctive Tuple-Generating Dependencies

Rule-based languages lie at the core of several areas of central importance to databases and artificial intelligence, such as data exchange, deductive databases, and knowledge representation and reasoning, to name a few. An algorithmic task that involves rules and is crucial for the above applications is query answering. In this work, we perform an in-depth complexity analysis of query answerin...

Expressive Completeness of Existential Rule Languages for Ontology-Based Query Answering

Existential rules, also known as data dependencies in Databases, have been recently rediscovered as a promising family of languages for Ontology-based Query Answering. In this paper, we prove that disjunctive embedded dependencies exactly capture the class of recursively enumerable ontologies in Ontology-based Conjunctive Query Answering (OCQA). Our expressive completeness result does not rely ...

Reasoning with Disjunctive Constrained Tuple-Generating Dependencies

The Impact of Disjunction on Query Answering Under Guarded-Based Existential Rules

We give the complete picture of the complexity of conjunctive query answering under (weakly-)(frontier-)guarded disjunctive existential rules, i.e., existential rules extended with disjunction, and their main subclasses, linear rules and inclusion dependencies.

Complexity Boundaries for Generalized Guarded Existential Rules

In this report, we establish complexities of the conjunctive query entailment problem for classes of existential rules (also called Tuple-Generating Dependencies or Datalog+/rules). Our contribution is twofold. First, we introduce the class of greedy bounded treewidth sets (gbts) of rules, which covers guarded rules, and their known generalizations, namely (weakly) frontierguarded rules. We pro...